A Note on Positive Dynamic Programming

Note on Practical Dynamic Programming

Since we convert the original sequential problem into a collection of small problems, it is important to make sure that the solution to each of the small problems is actually optimal in the original problem. In other words, the optimal choice in each of the two-period problem must be globally optimal to justify the transformation. Richard Bellman, the inventor of the dynamic programming method,...

A note on positive deniteness and stability of interval matrices

It is proved that by using bounds of eigenvalues of an interval matrix, someconditions for checking positive deniteness and stability of interval matricescan be presented. These conditions have been proved previously with variousmethods and now we provide some new proofs for them with a unity method.Furthermore we introduce a new necessary and sucient condition for checkingstability of interval...

A note on positive deniteness and stability of interval matrices

It is proved that by using bounds of eigenvalues of an interval matrix, someconditions for checking positive deniteness and stability of interval matricescan be presented. These conditions have been proved previously with variousmethods and now we provide some new proofs for them with a unity method.Furthermore we introduce a new necessary and sucient condition for checkingstability of interval...

A SHORT NOTE ON THE RELATIONSHIP BETWEEN GOAL PROGRAMMING AND FUZZY PROGRAMMING FOR VECTORMAXIMUM PROBLEMS

A theorem was recently introduced to establish a relationship betweengoal programming and fuzzy programming for vectormaximum problems.In this short note it is shown that the relationship does not exist underall circumstances. The necessary correction is proposed.

Research Note: A Dynamic Programming Approach to Customer Relationship Pricing